Linear models based on noisy data and the Frisch scheme
نویسندگان
چکیده
We address the problem of identifying linear relations among variables based on noisy measurements. This is a central question in the search for structure in large data sets. Often a key assumption is that measurement errors in each variable are independent. This basic formulation has its roots in the work of Charles Spearman in 1904 and of Ragnar Frisch in the 1930s. Various topics such as errors-in-variables, factor analysis, and instrumental variables all refer to alternative viewpoints on this problem and on ways to account for the anticipated way that noise enters the data. In the present paper we begin by describing certain fundamental contributions by the founders of the field and provide alternative modern proofs to certain key results. We then go on to consider a modern viewpoint and novel numerical techniques to the problem. The central theme is expressed by the Frisch-Kalman dictum, which calls for identifying a noise contribution that allows a maximal number of simultaneous linear relations among the noise-free variables-a rank minimization problem. In the years since Frisch's original formulation, there have been several insights, including trace minimization as a convenient heuristic to replace rank minimization. We discuss convex relaxations and theoretical bounds on the rank that, when met, provide guarantees for global optimality. A complementary point of view to this minimum-rank dictum is presented in which models are sought leading to a uniformly optimal quadratic estimation error for the error-free variables. Points of contact between these formalisms are discussed, and alternative regularization schemes are presented.
منابع مشابه
An Upper Bound on the Number of Linear Relations Identiied from Noisy Data by the Frisch Scheme
متن کامل
On computing the maximum corank in the Frisch scheme
The paper concerns the Frisch scheme for identii-cation of linear relations from static noisy data. The central problem is, for a given non-singular nn noisy, linearly independent data covariance matrix n , determine the maximal corank of n ? n , and associated maximizers ? n , over the set of diagonal uncorre-lated additive noise covariance matrices n such that n n , i.e. such that n ? ? n is ...
متن کاملComparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems
Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...
متن کاملRecursive Identification for Dynamic Linear Systems from Noisy Input-Output Measurements
Errors-in-variables (EIV) model is a kind of model with not only noisy output but also noisy input measurements, which can be used for systemmodeling in many engineering applications. However, the identification for EIVmodel is much complicated due to the input noises. This paper focuses on the adaptive identification problem of real-time EIV models. Some derivation errors in an accuracy resear...
متن کاملSystem Identification Based on Frequency Response Noisy Data
In this paper, a new algorithm for system identification based on frequency response is presented. In this method, given a set of magnitudes and phases of the system transfer function in a set of discrete frequencies, a system of linear equations is derived which has a unique and exact solution for the coefficients of the transfer function provided that the data is noise-free and the degrees of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM review. Society for Industrial and Applied Mathematics
دوره 57 2 شماره
صفحات -
تاریخ انتشار 2015